Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs
نویسندگان
چکیده
We present an approach to estimating distances in sensor networks. It works by counting common neighbors, high values indicating closeness. Such distance estimates are needed in many self-localization algorithms. Other than many other approaches, ours does not rely on special equipment in the devices.
منابع مشابه
Identifying codes in ( random ) geometric networks ∗ ( Technical report version )
It is important for networks built from wireless sensors technology to have a functional location detection system. Identifying codes, first introduced to model fault diagnosis of multi-processor systems, have recently proved to be useful to address this question. We are interested in the situation where the area of communication of each sensor is modelled by a disk: thus we consider identifyin...
متن کاملMetric Dimension for Gabriel Unit Disk Graphs Is NP-Complete
We show that finding a minimal number of landmark nodes for a unique virtual addressing by hop-distances in wireless ad-hoc sensor networks is NPcomplete even if the networks are unit disk graphs that contain only Gabriel edges. This problem is equivalent to Metric Dimension for Gabriel unit disk graphs. The Gabriel edges of a unit disc graph induce a planar O( √ n) distance and an optimal ener...
متن کاملSimple heuristics for unit disk graphs
Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line coloring heuristic which achieves a compe...
متن کاملAlgorithmic, geometric and graphs issues in wireless networks
We present an overview of the recent progress of applying computational geometry techniques to solve some questions, such as topology construction and broadcasting, in wireless ad hoc networks. Treating each wireless device as a node in a two dimensional plane, we model the wireless networks by unit disk graphs in which two nodes are connected if their Euclidean distance is no more than one. We...
متن کاملMultiple Target Tracking in Wireless Sensor Networks Based on Sensor Grouping and Hybrid Iterative-Heuristic Optimization
A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...
متن کامل